Constructive arithmetics in Ore localizations enjoying enough commutativity

نویسندگان

چکیده

This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness arithmetics within such localizations. Earlier we have introduced monoidal, geometric rational types localizations domains as objects studies. Here extend this classification to rings with zero divisors consider sets mentioned which are commutative enough: set either belongs algebra or it is central its elements commute pairwise. By using systematic approach developed before, prove that arithmetic localization polynomial give necessary algorithms. We also address important question computing local closure ideals known desingularization, present an algorithm for computation symbolic power given ideal ring. provide algorithms compute closures certain respect enough commutativity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructive Arithmetics in Ore Localizations of Domains

For a non-commutative domain R and a multiplicatively closed set S the (left) Ore localization of R at S exists if and only if S satisfies the (left) Ore property. Since the concept has been introduced by Ore back in the 1930’s, Ore localizations have been widely used in theory and in applications. We investigate the arithmetics of the localized ring SR from both theoretical and practical point...

متن کامل

-matrix Arithmetics in Linear Complexity -matrix Arithmetics in Linear Complexity

For hierarchical matrices, approximations of the matrix-matrix sum and product can be computed in almost linear complexity, and using these matrix operations it is possible to construct the matrix inverse, efficient precondi-tioners based on approximate factorizations or solutions of certain matrix equations. H 2-matrices are a variant of hierarchical matrices which allow us to perform certain ...

متن کامل

Enjoying to Work

occasion of his 65th birthday. Mario is a unique combination of enthusiasm and mathematical talent, scientific devotion and altru-ism. He contributed massively and in a significant way to research in computer science. During the last decade his research was focused on membrane computing, where he contributed fundamental results especially related to computational complexity as well as results r...

متن کامل

Arithmetics in ß-Numeration

The β-numeration, born with the works of Rényi and Parry, provides a generalization of the notions of integers, decimal numbers and rational numbers by expanding real numbers in base β, where β > 1 is not an integer. One of the main differences with the case of numeration in integral base is that the sets which play the role of integers, decimal numbers and rational numbers in base β are not st...

متن کامل

Finite Arithmetics

Let FM (A), for A = (ω, . . .), be a family of finite, initial segments of A. One can see FM (A) as a family of finite arithmetics related to the arithmetic A. In the talk I will survey what is known about such arithmetics and their logical properties. The main questions will be the following: What is the complexity of theories of such families? What relations can be represented in such familie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2021

ISSN: ['1095-855X', '0747-7171']

DOI: https://doi.org/10.1016/j.jsc.2019.10.016